#include <iostream>
#include<cstdio>
using namespace std;
bool isPrimeNumber(int num) {
    if (num <= 1) {
        return false;
    }
    for (int i = 2; i <= num / 2; i++) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

void decodeEvenToPrime(int num) {
    int half = num / 2;
    for (int i = 2; i <= half; i++) {
        if (isPrimeNumber(i) && isPrimeNumber(num - i)) {
            printf("偶数%d的素数分解结果: %d = %d + %d\n", num, num, i, num - i);
        }
    }
}

int main() {
    int N;
    cout << "-------------------------------" << endl;
    cout << "请输入一个整数N (N>6): ";
    cin >> N;
    cout << "-------------------------------" << endl;
    
    // 输出小于整数N的所有偶数的素数分解形式
    for (int num = 6; num < N; num += 2) {
        decodeEvenToPrime(num);
    }

    cout << "-------------------------------" << endl;
    cout << "输出完毕!" << endl;

    return 0;
}